Singapore : world scientific , 1994 . 4 li h , wu y . automated theorem proving in projective geometry with cayley and bracket algebras 其中特征列方法是定理機器證明與方程求解的基礎,也是數學機械化領域目前研究的核心內容。
1 wu w t . on the decision problem and the mechanization of theorem - proving in elementary geometry . scientia sinica , 1978 , : 159 - 172 . re - published in em automated theorem proving : after 25 years , 1984 , pp . 213 - 234 本文第一作者于上世紀七十年代末開始從事數學機械化研究,致力于實現推理與方程求解的自動化,并創立了幾何定理機器證明的吳方法與方程求解的特征列方法。
In proposbonal calculus , the processing ofresoluhon pdriciple have combination explosion naturally so , how to eltw combinaion explosion in the processing of resolution ( genetal showed computationaily hard problem ) is an in1portan subject in automated theorem proving 命題邏輯系統中的歸結原理本質上存在組合問題,因此,如何避免組合問題(通常以計算復雜性的形式出現)是自動推理研究中的一個重要課題。
In this paper , it s applications were explained from seven different fields , the common zeros of two polynomials , the multiplicities of roots and the discrimination of a polynomial , searching the equations suitable for a algebraic number , implicating a rational curve over the plane , computing the zeros of a nonlinear algebraic equation and gathering the discrimination surface of the sas in automated theorem proving on inequalities 本文從7個方面闡述了結式的應用,包括判斷2個多項式的公共零點,判定多項式是否有重根,計算多項式的判別式,尋找代數數滿足的方程,平面有理曲線的隱式化,非線性代數方程組求解和不等式機器證明中半代數系統邊界曲面的獲得等。
Automated theorem proving (also known as ATP or automated deduction) is a subfield of automated reasoning dealing with proving mathematical theorems by computer programs. Automated reasoning over mathematical proof was a major impetus for the development of computer science.